An operator embedding theorem for complexity classes of recursive functions

An Operator Embedding Theorem for Complexity Classes of Recursive Functions

Classification of recursive functions into polynomial and superpolynomial complexity classes

We present a decidable and sound criterion for classifying recursive functions over higher-order data structures into polynomial and superpolynomial complexity classes generalizing the seminal results by Bellantoni and Cook [1] and Leivant [4] to complex structural datatypes. The criterion is complete for the special case of binary strings; whether it is also complete for arbitrary higherorder ...

Non Primitive Recursive Complexity Classes

The introduction of Well Structured Transition Systems (WSTS) in 1987 [8], i.e. transition systems that satisfies a monotony property with respect to some well-quasi-ordering (wqo), has led to an important number of decidability results of verification problems for several natural models: Petri Nets and VASS and a large number of their extensions, lossy channel systems, string rewrite systems, ...

On convolution properties for some classes of meromorphic functions associated with linear operator

In this paper, we defined two classes $S_{p}^{ast }(n,lambda ,A,B)$ and\ $ K_{p}(n,lambda ,A,B)$ of meromorphic $p-$valent functions associated with a new linear operator. We obtained convolution properties for functions in these classes.

Combined complexity classes for finite functions

— A new measure of commutation which combines the three most popular computational resources (time, space, and size) is proposed in this paper. The computable sets are divided into classes according to this measure by taking unions of families offïnite problems. These classes are shown toform a hierarchy and arefound to differfrom the classical complexity classes. Also, bounds are establishedfo...